Frequency Domain Representations of Surfaces
نویسندگان
چکیده
We present \surface frequency" representations, which describe how Cartesian positions on a surface vary with the intrinsic position along the surface. These representations are constructed using optimized coordinate values, individual sample weights, and an iterative transform algorithm. We then use surface frequency to monitor a deformable surface model and increase the number of samples when there is suucient evidence of undersampling. The resulting model starts with fewer samples, but achieves comparable target delity.
منابع مشابه
Quadrature Amplitude Modulated Digital Radio Transmission Modeling and Simulation
Computer aided design and computer aided modeling tools are becoming increasingly important in the design and performance evaluation of communication systems. In this work, we report on the computer simulation modeling study of terrestrial digital microwave radio transmission, using Block Oriented System Simulator package (BOSS). The work concentrates on semi-analytical error rate evaluation in...
متن کاملEMG-based wrist gesture recognition using a convolutional neural network
Background: Deep learning has revolutionized artificial intelligence and has transformed many fields. It allows processing high-dimensional data (such as signals or images) without the need for feature engineering. The aim of this research is to develop a deep learning-based system to decode motor intent from electromyogram (EMG) signals. Methods: A myoelectric system based on convolutional ne...
متن کاملCoupling of a time domain boundary element method to compliant surface models
The Boundary Element Method (BEM) can be used to predict the scattering of sound in rooms. It reduces the problem of modelling the volume of air to one involving only the surfaces; hence the number of unknowns scales more favourably with problem size and frequency than it does for volumetric methods such as FEM and FDTD. The time domain BEM predicts the transient scattering of sound, and is usu...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملDeep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning
Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...
متن کامل